Efficient local search for L_1 and L_2 binary matrix factorization
نویسندگان
چکیده
منابع مشابه
Improved Local Search for Binary Matrix Factorization
Rank K Binary Matrix Factorization (BMF) approximates a binary matrix by the product of two binary matrices of lower rank, K, using either L1 or L2 norm. In this paper, we first show that the BMFwithL2 norm can be reformulated as an Unconstrained Binary Quadratic Programming (UBQP) problem. We then review several local search strategies that can be used to improve the BMF solutions obtained by ...
متن کاملMatrix Factorization as Search
Simplex Volume Maximization (SiVM) exploits distance geometry for e ciently factorizing gigantic matrices. It was proven successful in game, social media, and plant mining. Here, we review the distance geometry approach and argue that it generally suggests to factorize gigantic matrices using search-based instead of optimization techniques. 1 Interpretable Matrix Factorization Many modern data ...
متن کاملMatrix factorization with binary components
Motivated by an application in computational biology, we consider low-rank matrix factorization with {0, 1}-constraints on one of the factors and optionally convex constraints on the second one. In addition to the non-convexity shared with other matrix factorization schemes, our problem is further complicated by a combinatorial constraint set of size 2m·r, where m is the dimension of the data p...
متن کاملCluster Indicator Decomposition for Efficient Matrix Factorization
We propose a new clustering based low-rankmatrix approximation method, Cluster Indicator Decomposition (CID), which yields more accurate lowrank approximations than previous commonly used singular value decomposition and other Nyström style decompositions. Our model utilizes the intrinsic structures of data and theoretically be more compact and accurate than the traditional low rank approximati...
متن کاملWeighted Rank-One Binary Matrix Factorization
Mining discrete patterns in binary data is important for many data analysis tasks, such as data sampling, compression, and clustering. An example is that replacing individual records with their patterns would greatly reduce data size and simplify subsequent data analysis tasks. As a straightforward approach, rank-one binary matrix approximation has been actively studied recently for mining disc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Intelligent Data Analysis
سال: 2016
ISSN: 1088-467X,1571-4128
DOI: 10.3233/ida-160832